Error Detection and Correction of Parallel Ffts Using Parsevals Check

Soft errors are the most common problems faced now days. They could be corrected using software functions .Communications and signal processing systems are no exceptions to this trend. For some applications, an interesting option is to use algorithmic-based fault tolerance (ABFT) techniques that try to exploit the algorithmic properties to detect and correct errors. Signal processing and communication applications are well suited for ABFT. One example is fast Fourier transforms (FFTs) that are a key building block in many systems. Several protection schemes have been proposed to detect and correct errors in FFTs. Among those, probably the use of the Parseval or sum of squares checks is the most widely known. In modern communication systems, it is increasingly common to find several blocks operating in parallel. So we implement fault tolerant parallel FFts using error correction codes (redundant bits) and sum of squares (parsevals check).